Verifiable Computation with Reduced Informational Costs and Computational Costs
نویسندگان
چکیده
منابع مشابه
Hospital quality choice and market structure in a regulated duopoly.
This paper analyzes the optimal structure of a regulated health care industry in a model in which the regulator cannot enforce what hospitals do (unverifiable quality of health) or does not know what hospitals know (incomplete information about production costs) or both. We show that if quality is unverifiable the choice between monopoly and duopoly does not change with respect to the verifiabl...
متن کاملVerifiable Computation in Multiparty Protocols with Honest Majority
We present a generic method for turning passively secure protocols into protocols secure against covert attacks. The method adds a post-execution verification phase to the protocol that allows a misbehaving party to escape detection only with negligible probability. The execution phase, after which the computed protocol result is already available for parties, has only negligible overhead added...
متن کاملDesigning an integrated production/distribution and inventory planning model of fixed-life perishable products
This paper aims to investigate the integrated production/distribution and inventory planning for perishable products with fixed life time in the constant condition of storage throughout a two-echelon supply chain by integrating producers and distributors. This problem arises from real environment in which multi-plant with multi-function lines produce multi-perishable products with fixed life ti...
متن کاملVerifiable computation using multiple provers
The increasing ubiquity of the cloud computing paradigm has renewed focus on the classical problem ofallowing weak clients to check the results of computation delegated to powerful servers. Recent advancesin proof-based verifiable computation have led to several near-practical protocols. Protocols based oninteractive proofs (IPs) work with highly restrictive models of computation an...
متن کاملEfficient RAM and control flow in verifiable outsourced computation
Recent work on proof-based verifiable computation has resulted in built systems that employ tools from complexity theory and cryptography to address a basic problem in systems security: allowing a local computer to outsource the execution of a program while providing the local computer with a guarantee of integrity and the remote computer with a guarantee of privacy. However, support for progra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014